Odd even shifts in SIMD hypercubes
نویسندگان
چکیده
منابع مشابه
Optimal Routing for Odd-Even Rotations on BRGC Hypercubes
It has been an open problem for a long time whether there exists an optimal routing algorithm for rotations on BRGC hypercubes such that all the paths are shortest and link-disjoint. In this paper, we consider the routing problem of odd-even rotations on BRGC hypercubes. It is a generalization of the rotation problem on BRGC hypercubes such that even nodes and odd nodes can have different rotat...
متن کاملFault Tolerant Broadcasting in SIMD Hypercubes
In this paper, we propose an optimal fault tolerant broadcasting algorithm which requires only n + 1 steps for an SIMD hypercube with up to n-1 faulty nodes. The basic idea of the proposed algorithm is first to find a fault-free subcube (CS) which contains the source node (S) such that each neighboring subcube of the subcube CS contains at least one fault. N e d , the message is broadcast along...
متن کاملFault-tolerant sorting in SIMD hypercubes
This paper conszders sortang a n SIMD hypercube nrultaprocessors En the presence o f node fazlures. The proposed algorzthm correctly sorts u p t o 2n = N keys 21) a faulty SIMD hyperrube of dtmt nsaon n containzng u p to n 1 faulty n0dt.s The proposed fault-tolerant abgonfhm employs radix sort. W P u s e a pazr of j l ood dcmensaons whach help+ t o route daia around the faulty prsocessors durtn...
متن کاملSynchrotron Radiation Studies on Even-Odd and Odd-Even Nylons
Aliphatic polyamides derived from odd diamine or odd dicarboxylic acid units cannot adopt a conventional sheet structure when molecular chains have an all trans conformation. However, typical fiber diffraction patterns of this sheet structure were observed in several polyamides derived from odd units such as nylons 65 and 56. Consequently, a new structure based on the establishment of intermole...
متن کاملOdd-Even Sort in Powerlists
In 6] Misra introduced the powerlist notation and used it to succintly describe several parallel algorithms. In particular, algorithms that use a balanced divide and conquer strategy have elegant descriptions as powerlist functions. Among the examples presented were two sorting networks due to Batcher 1]. To prove their correctness a-posteriori, Misra used the 0-1 principle, which states that a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 1990
ISSN: 1045-9219
DOI: 10.1109/71.80126